A note on the minimum size of a vertex pancyclic graph
نویسنده
چکیده
Let G be a graph on n/> 3 vertices. Then G is vertex pancyclic if every vertex of G is contained in cycles of length 3, 4, . . . , n. Let m n denote the minimum number of edges of a vertex pancyclic graph on n vertices. We show that m 3 = 3, m, = 5, m 5 = 7, m 6 = 9, and ~ n < m. ~< [_~ n ] (n >~ 7).
منابع مشابه
Minimum Degree Conditions for Cycles Including Specified Sets of Vertices
This paper generalises the concept of vertex pancyclic graphs. We define a graph as set-pancyclic if for every set S of vertices there is a cycle of every possible length containing S. We show that if the minimum degree of a graph exceeds half its order then the graph is set-pancyclic. We define a graph as k-ordered-pancyclic if, for every set S of cardinality k and every cyclic ordering of S, ...
متن کاملA note on vertex pancyclic oriented graphs
Let D be an oriented graph of order n 9, minimum degree n ? 2, such for choice of distinct vertices x and y, either xy 2 E(D) or d + (x)+d ? (y) n?3. Song (J. Graph Theory 18 (1994), 461{468) proved that D is pancyclic. In this note, we give a short proof, based on Song's result, that D is in fact vertex pancyclic. This also generalizes a result of Jackson (J. Graph Theory 5 (1981), 147{157) fo...
متن کاملPancyclicity of Hamiltonian and highly connected graphs
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length ` for all 3 ≤ ` ≤ n. Write α(G) for the independence number of G, i.e. the size of the largest subset of the vertex set that does not contain an edge, and κ(G) for the (vertex) connectivity, i.e. the size of the smallest subset of the vertex set that can be deleted to obtain a...
متن کاملVertex-pancyclicity of hypertournaments
Abstract: A hypertournament or a k-tournament, on n vertices, 2≤k≤n, is a pair T= (V,E), where the vertex setV is a set of size n and the edge setE is the collection of all possible subsets of size k of V, called the edges, each taken in one of its k! possible permutations. A k-tournament is pancyclic if there exists (directed) cycles of all possible lengths; it is vertex-pancyclic if moreover ...
متن کاملA note on vertex-edge Wiener indices of graphs
The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 164 شماره
صفحات -
تاریخ انتشار 1997